Universal links for S2×S1

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theoretical links between universal and Bayesian compressed sensing algorithms

Quantized maximum a posteriori (Q-MAP) is a recently-proposed Bayesian compressed sensing algorithm that, given the source distribution, recovers X from its linear measurements Y m = AX, where A ∈ R denotes the known measurement matrix. On the other hand, Lagrangian minimum entropy pursuit (L-MEP) is a universal compressed sensing algorithm that aims at recovering X from its linear measurements...

متن کامل

Geometric Structures on Branched Covers over Universal Links

A number of recent results are presented which bear on the question of what geometric information can be gleaned from the representation of a three-manifold as a branched cover over a fixed universal link. Results about Seifert-fibered manifolds, graph manifolds and hyperbolic manifolds are discussed. Section 0 Introduction. Closed, orientable three-manifolds admit a variety of universal constr...

متن کامل

Universal Vassiliev invariants of links in coverings of 3-manifolds

We study Vassiliev invariants of links in a 3-manifold M by using chord diagrams labeled by elements of the fundamental group of M . We construct universal Vassiliev invariants of links in M , where M = P 2×[0, 1] is a cylinder over the real projective plane P 2, M = Σ× [0, 1] is a cylinder over a surface Σ with boundary, and M = S1 × S2. A finite covering p : N −→ M induces a map π1(p) ∗ betwe...

متن کامل

Universal Semi-local Election Protocol Using Forward Links

We consider finite connected undirected graphs as a model for anonymous computer networks. In this framework we show a general purpose distributed election protocol, which uses forward links over the standard communication channels between processors. The forward links are represented in the form of structured labels, so the algorithm is in fact a graph relabelling system. However, its transfor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1998

ISSN: 0030-8730

DOI: 10.2140/pjm.1998.182.55